RESOLVING STANLEY’S e-POSITIVITY OF CLAW-CONTRACTIBLE-FREE GRAPHS
نویسندگان
چکیده
In Stanley’s seminal 1995 paper on the chromatic symmetric function, he stated that there was no known graph that was not contractible to the claw and whose chromatic symmetric function was not e-positive, namely, not a positive linear combination of elementary symmetric functions. We resolve this by giving infinite families of graphs that are not contractible to the claw and whose chromatic symmetric functions are not e-positive. Moreover, one such family is additionally claw-free, thus establishing that the e-positivity of chromatic symmetric functions in general is not dependent on the claw.
منابع مشابه
MOD ( 2 p + 1 ) - ORIENTATIONS AND
In this paper, we establish an equivalence between the contractible graphs with respect to the mod (2p + 1)-orientability and the graphs with K1,2p+1-decompositions. This is applied to disprove a conjecture proposed by Barat and Thomassen that every 4-edge-connected simple planar graph G with |E(G)| ≡ 0 (mod 3) has a claw decomposition.
متن کاملMinimal Claw-Free Graphs
A graph G is a minimal claw-free graph (m.c.f. graph) if it contains no K1,3 (claw) as an induced subgraph and if, for each edge e of G, G − e contains an induced claw. We investigate properties of m.c.f. graphs, establish sharp bounds on their orders and the degrees of their vertices, and characterize graphs which have m.c.f. line graphs. MSC 2000: 05C75, 05C07
متن کاملSupereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs
A graph G is supereulerian if it has a spanning eulerian subgraph. We prove that every 3-edge-connected graph with the circumference at most 11 has a spanning eulerian subgraph if and only if it is not contractible to the Petersen graph. As applications, we determine collections F1, F2 and F3 of graphs to prove each of the following (i) Every 3-connected {K1,3, Z9}-free graph is hamiltonian if ...
متن کاملMod (2p + 1)-Orientations and $K1,2p+1-Decompositions
In this paper, we established an equivalence between the contractible graphs with respect to the mod (2p + 1)-orientability and the graphs with K1,2p+1-decompositions. This is applied to disprove a conjecture proposed by Barat and Thomassen that every 4-edge-connected simple planar graph G with |E(G)| ≡ 0 (mod 3) has a claw-decomposition.
متن کاملClaw-free graphs, skeletal graphs, and a stronger conjecture on $ω$, $Δ$, and $χ$
The second author’s ω, ∆, χ conjecture proposes that every graph satisties χ ≤ d 1 2 (∆ + 1 + ω)e. In this paper we prove that the conjecture holds for all claw-free graphs. Our approach uses the structure theorem of Chudnovsky and Seymour. Along the way we discuss a stronger local conjecture, and prove that it holds for claw-free graphs with a three-colourable complement. To prove our results ...
متن کامل